智模数(IFN)在密码科学中的研究及应用

为了消除传统的纯数字加密技术(PNCT)保密性的缺陷,即泄密性、期限性和死密性,提出了一种新的基于变进数(VCN)智能特性的PNCT。传统的PNCT生成的准密码数均是恒进数(FCN),其变化规则(FCR)的单一性、机械性和难记性,造成其保密性缺陷。VCN则是FCN的拓展,是一种新的更为广义概念上的数,但其变化规则(VCR)的复杂性、智能性和灵活性,可以克服FCN的保密性缺陷。     

Ion migration in liquid polymer electrolytes

Solutions of alkali metal thiocyanates in liquid copolymers of ethylene oxide and propylene oxide provide a convenient medium for measuring conductivities, viscosities and transport numbers in polymer electrolytes by classical methods. The high value of the anion transport number (typically ca. 0.95) is noteworthy. A model, which emphasises the importance of intramolecular solvation of cations, the effects of ion pairing and redissociation, and the crosslinking action of anions at high salt concentrations, accounts satisfactorily for the properties of these liquid systems.     

Microhardness of rhombohedral crystals: Calcite and sodium nitrate

The variation of hardness of rhombohedral single crystals of calcite and sodium nitrate with quenching temperature is studied. Vickers and Knoop hardness numbers are determined from the indentations produced on freshly-cleaved crystal surfaces for various loads. The variation of hardness number with quenching temperature can be represented byHT _q ^k =constant where the exponentk is less than unity and its sign determines the nature of material.     

Rantest: a fortran iv program for testing randomness of uniform pseudorandom numbers

Computer-generated random numbers form the basis of most Monte-Carlo simulations and similar work. A FORTRAN program—RANTEST—was written that performs various statistical and empirical tests of randomness on uniform (0, 1) pseudorandom numbers.     

An improvement for the McGill University Random Number Package

This paper documents and provides code for two new entry points which increase the flexibility of the McGill University Random Number Package. With these additions the user can access internal locations containing the pseudo-random integers that control the random sequences produced by the generator. A detailed example of the use of the new entry points is provided. Finally, some comments about the documentation of random number generators are made.     

On the surface area of the -star graph

We present an explicit formula for the surface area of the (n,k)-star graph, i.e., the number of nodes at a certain distance from the identity node in the graph, by identifying the unique cycle structures associated with the nodes in the graph, deriving a distance expression in terms of such structures between the identity node of the graph and any other node, and enumerating those cycle structures satisfying the distance restriction.The above surface area derivation process can also be applied to some of the other node symmetric interconnection structures defined on the symmetric group, when the aforementioned distance expression is available.     

Sampling methods for shortest vectors,closest vectors and successive minima

We study four problems from the geometry of numbers, the shortest vector problem  (Svp)$\left(\text{<small-caps>Svp</small-caps>}\right)$, the closest vector problem  (Cvp)$\left(\text{<small-caps>Cvp</small-caps>}\right)$, the successive minima problem  (Smp)$\left(\text{<small-caps>Smp</small-caps>}\right)$, and the shortest independent vectors problem   (Sivp$\text{<small-caps>Sivp</small-caps>}$). Extending and generalizing results of Ajtai, Kumar, and Sivakumar we present probabilistic single exponential time algorithms for all four problems for all _?p${?}_p$ norms. The results on Smp$\text{<small-caps>Smp</small-caps>}$ and Sivp$\text{<small-caps>Sivp</small-caps>}$ are new for all norms. The results on Svp$\text{<small-caps>Svp</small-caps>}$ and Cvp$\text{<small-caps>Cvp</small-caps>}$ generalize previous results of Ajtai et al. for the Euclidean _?2${?}_2$ norm to arbitrary _?p${?}_p$ norms. We achieve our results by introducing a new lattice problem, the generalized shortest vector problem   (GSvp$\text{<small-caps>GSvp</small-caps>}$). ¹ We describe a single exponential time algorithm for GSvp$\text{<small-caps>GSvp</small-caps>}$. We also describe polynomial time reductions from Svp,Cvp,Smp$\text{<small-caps>Svp</small-caps>},\text{<small-caps>Cvp</small-caps>},\text{<small-caps>Smp</small-caps>}$, and Sivp$\text{<small-caps>Sivp</small-caps>}$ to GSvp$\text{<small-caps>GSvp</small-caps>}$, establishing single exponential time algorithms for the four classical lattice problems. This approach leads to a unified algorithmic treatment of the lattice problems Svp,Cvp,Smp$\text{<small-caps>Svp</small-caps>},\text{<small-caps>Cvp</small-caps>},\text{<small-caps>Smp</small-caps>}$, and Sivp$\text{<small-caps>Sivp</small-caps>}$.     

A pseudo-random network mobile automaton with linear growth

Based on the mobile automaton model, an algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics. In a first phase, graph growth appears to be pseudo-random and O(n) then it settles to a very regular behavior and rate. A pseudo-random mobile automaton is already known; the new automaton provides now a finite, but surprisingly long, pseudo-random, linear growth process. Applications of mobile automata to fundamental physics and quantum gravity have been recently suggested.     

基于模糊层次分析法的供电服务质量综合评价模型研究和实证分析

通过研究供电企业服务客户的业务环节和质量控制过程构建了供电服务质量评价指标体系,提出了将模糊数学、模糊层次分析法、群组决策方法相结合的供电服务质量综合评价模型,解决了构造比较判断矩阵中的模糊不确定性问题,最后以某市供电公司为例进行了实证分析并论证了该模型的合理性。     

区间数互补判断矩阵排序的一种新方法

研究了决策信息以区间数互补判断矩阵形式给出的多目标决策问题．给出了区间数一致性互补判断矩阵的概念及其判定定理；建立了一个目标规划模型，通过求解该模型得到区间数互补判断矩阵的权重向量；利用已有的可能度公式对方案进行排序与择优．提出了区间数互补判断矩阵排序的目标规划法，该方法具有操作简便和易于上机实现的特点．